Determinization and Limit-Determinization of Emerson-Lei Automata

We study the problem of determinizing \(\omega \)-automata whose acceptance condition is defined on transitions using Boolean formulas, also known as transition-based Emerson-Lei automata (TELA). The standard approach to determinize TELA first constructs an equivalent generalized Buchi automaton (GBA), which later determinized. introduce three new ways translating GBA. Furthermore, we give a determinization construction determinizes several GBA separately and combines them product construction. An experimental evaluation shows that competitive when compared with state-of-the-art procedures. limit-determinization show this can be done single-exponential blow-up, in contrast double-exponential lower-bound for determinization. Finally, one version procedure yields good-for-MDP used quantitative probabilistic model checking.